On Equational
نویسنده
چکیده
Generalizations of Craig interpolation are investigated for equational logic. Our approach is to do as much as possible at a categorical level, before drawing out the concrete implications.
منابع مشابه
FUZZY EQUATIONAL CLASSES ARE FUZZY VARIETIES
In the framework of fuzzy algebras with fuzzy equalities and acomplete lattice as a structure of membership values, we investigate fuzzyequational classes. They consist of special fuzzy algebras fullling the samefuzzy identities, dened with respect to fuzzy equalities. We introduce basicnotions and the corresponding operators of universal algebra: construction offuzzy subalgebras, homomorphisms...
متن کاملTerm Equational Systems and Logics
We introduce an abstract general notion of system of equations between terms, called Term Equational System, and develop a sound logical deduction system, called Term Equational Logic, for equational reasoning. Further, we give an analysis of algebraic free constructions that together with an internal completeness result may be used to synthesise complete equational logics. Indeed, as an applic...
متن کاملSEQUENTIALLY COMPACT S-ACTS
The investigation of equational compactness was initiated by Banaschewski and Nelson. They proved that pure injectivity is equivalent to equational compactness. Here we define the so called sequentially compact acts over semigroups and study some of their categorical and homological properties. Some Baer conditions for injectivity of S-acts are also presented.
متن کاملEquational Uniication, Word Uniication, and 2 Nd -order Equational Uniication
For nite convergent term-rewriting systems it is shown that the equational unii-cation problem is recursively independent of the equational matching problem, the word matching problem, and the 2 nd-order equational matching problem. Apart from the latter these results are derived by considering term-rewriting systems on signatures that contain unary function symbols only (that is, string-rewrit...
متن کاملUni cation in Extensions of Shallow Equational Theories
We show that uni cation in certain extensions of shallow equational theories is decidable Our extensions generalize the known classes of shallow or standard equational theories In order to prove de cidability of uni cation in the extensions a class of Horn clause sets called sorted shallow equational theories is introduced This class is a natural extension of tree automata with equality constra...
متن کاملEquational zero vector databases, non-equational databases, and inherent internal control
Equational zero vector accounting systems, based on duality principles and the double-entry model, were designed as ontological control systems to help prevent and detect fraud and errors inherent in non-equational, single-entry systems. Non-equational systems lend themselves to fraud and errors to a larger degree because the internal control inherent in an equational zero vector system has no ...
متن کامل